Reasoning About Data Provided By Federated Deductive Databases

This paper focuses on the problem of reasoning with information provided by a group of databases which share a common set of rules (deductive rules, integrity constraints). Each database is assumed to be consistent with the rules, but federating them may lead to contradictions. This paper describes a logic of beliefs, based on KD logic, for reasoning with contradictory information provided by several databases. It also presents a theorem prover, associated with this logic. This prover, described as a meta-interpreter of PROLOG allows us to derive formulas of the form: given the databases and the rules, assuming an order of relative reliability between the databases, is a given formula deducible? or, what are the individuals which satisfy a given formula? When the set of rules is not recursive, we prove the correctness of this theorem-prover.     

Strong Paraconsistency and the Basic Constructive Logic for an Even Weaker Sense of Consistency

In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (‘E contradictione quodlibet’) rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F-consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency and F-consistency; (b) to define the concept of strong paraconsistency; (c) to build up a series of strongly paraconsistent logics; (d) to define the basic constructive logic adequate to a rather weak sense of consistency. All logics treated in this paper are strongly paraconsistent. All of them are sound and complete in respect a modification of Routley and Meyer’s ternary relational semantics for relevant logics (no logic in this paper is relevant).     

扩充析取逻辑程序的争论语义

该文探讨争论推理在扩充逻辑程序中的实现及其关系问题.基于“相干原理”,建立了扩充逻辑程序的争论推理框架,多种争论推理形式都可以嵌入其中.特别是提出了一种谨慎语义Acc.同时又定义了良基语义的一种合理扩充Mod,以处理较为大胆的推理形式.另外也研究了相关的理论性质.     

汉语逻辑补足义标注框架研究

逻辑补足义是指附加在以谓词为中心的基本命题成分之上的否定、程度、时体、模态和语气等, 具体表现为逻辑语义算子对谓词的语义约束关系,是基本命题成分所表达语义关系的有效补充。在句子中,逻辑补足义所表达的语义是句子深度语义理解的重要层面。该文以深层语义理解为目标,在逻辑补足义已有的研究基础上,建立了否定、程度、时体和语气分类体系,构建了相应的算子词典;制定标注规范,对已经标注了基本命题义语义角色的句子进行各类逻辑补足义的标注;最后,对标注的结果进行统计并对标注过程中出现的问题进行了分析。     

基于多种群量子进化的区间二型模糊规则挖掘算法

利用智能优化算法挖掘模糊分类规则能够解决模糊前件参数和无关项的组合优化问题,但也存在依赖初始规则以及更新过程无指导等缺陷,导致分类精度难以保证.为此,本文以二型模糊规则分类系统为框架,采用模糊聚类得到代表性样本并启发式的产生初始规则,以量子等位基因形式对规则进行编码生成多初始种群,根据基因的优良性,以变尺度变异操作实现等位基因的指导性进化.在此基础上,利用矛盾规则重构机制,提高模糊规则分类系统的精度.将所提出算法与FH–GBML–IVFS–Amp算法和GAGRAD算法进行了分类精度对比,并在不同噪声水平下,与C4.5算法、朴素贝叶斯分类器和BP神经网络进行分类鲁棒性比较,实验结果表明所提出算法具有较好分类精度与鲁棒性.     

Algorithmic Debugging and Hypothetical Reasoning

This paper presents a generalization of Shapiro style algorithmic debugging for generalized Horn clause intuitionistic logic. This logic offers hypothetical reasoning and negation is defined not by failure but by inconsistency. We extend Shapiro's notion of intended interpretation, symptoms and errors and give formal results paralleling those known for definite clauses. We also show how a corresponding diagnosis module for RISC- a logic programming system for generalized Horn clause intuitionistic logic-can be defined by meta interpretation. In contrast to Shapiro's PROLOG modules ours work independently of the specific computation rule that in RISC may be specified by the user.     

旧城改造中房屋拆迁的矛盾冲突及其解决方法

针对目前旧城改造中房屋拆迁引发的矛盾冲突问题,从各个角度考虑,分析了旧城改造房屋拆迁中利益矛盾冲突的类型,从宏观和微观两个角度论述了造成矛盾冲突的原因,并提出了拆迁利益矛盾冲突的解决方法。     

基于可拓学和HowNet的策略生成系统研究进展

在已有可拓策略生成系统框架基础上,利用可拓信息-知识-策略形式化表示体系、HowNet的知识系统描述语言(KDML)和Agent的智能引导,建立了基于可拓学和HowNet的策略生成系统的基本流程和系统框架结构,增强了可拓策略生成系统解决矛盾问题的能力,改善了知识资源缺乏问题,提高了其问题模型建立的准确性和知识处理能力。初步的应用显示了该研究的优越性。把可拓学和HowNet这2个中国原创的理论和应用工具相结合研究策略生成系统,将使这项有别于传统研究思路的基础研究取得重要突破,产生具有完全自主知识产权的成果。这也是为将来能实现矛盾问题的智能化处理作基础性的工作。